A Standard Representation of Imperative Language Programs
نویسندگان
چکیده
Numerous research results in the areas of software measures and software tools are predicated on a particular programming language, or on some characterizations of a programming language. For example, numerous software measures have been de ned only for structured programming languages and several of the reported approaches to program testing de ne a speci c language. However, this proliferation of languages upon which measures and tools are de ned makes independent evaluation and comparison of measures and tools problematic. We propose a standard representation of imperative language programs which is independent of the syntax of any particular programming language, yet the standard representation supports the de nition of a wide range of tools and measures. Additionally, the standard representation will allow for the masking of actual program semantics. Thus the standard representation provides a vehicle by which large volumes of industrial software might be made available to researchers while protecting the proprietary nature of the programs. Dr. Baker is currently a Shell Faculty Fellow, supported in part by the Shell Companies Foundation, Inc.
منابع مشابه
Program verification using symbolic game semantics
We introduce a new symbolic representation of algorithmic game semantics, and show how it can be applied for efficient verification of open (incomplete) programs. The focus is on an Algol-like programming language which contains the core ingredients of imperative and functional languages, especially on its second-order recursion-free fragment with infinite data types. We revisit the regular-lan...
متن کاملControl Constructs in a Completely Visual Imperative Programming Language University of Colorado at Boulder Control Constructs in a Completely Visual Imperative Programming Language
Visual representations of programs can facilitate program understanding by presenting aspects of programs using explicit and intuitive representations. We have designed a completely visual static and dynamic representation of an imperative programming language. Because our representation of control is completely visual, programmers of this language can understand the static and dynamic semantic...
متن کاملHorn clauses as an intermediate representation for program analysis and transformation
Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program representation throughout the compilation process. With restrictions ensuring determinism and single-modedness, a logic program can easily be transformed to machine l...
متن کاملGraphite: Towards a Declarative Polyhedral Representation
Classical polyhedral representations of imperative languages entangle untranslated scalar imperative operations to the declarative descriptions of the polyhedral model. This representation can handle high level array operations, but is more difficult to work on programs that split the array computations in smaller chunks involving scalar temporary variables. The aim of the current paper is to p...
متن کاملSOS C--: a System for interpreting Operational Semantics of C-- programs
This paper describes a system for automatically transforming programs written in a simple imperative language (called C--), into a set of first-order equations. This means that a set of first-order equations used to represent a C-program already has a precise mathematical meaning; moreover, the standard techniques for mechanizing equational reasoning can be used for verifying properties of prog...
متن کامل